C.B. Hempel, Deductive-Nomological Vs. Statistical Explanation
نویسندگان
چکیده
منابع مشابه
Cooperative Explanation in Deductive Databases
1 Motivation As knowledge-based systems become more complex in design and capability, their ability to communicate with their users must keep pace. Otherwise, the typical user will be unable to take full advantage of the sophisticated tools that modern knowledge base technology can and will make available. A major concern of researchers who seek to improve human-computer communication involves ...
متن کامل3 Carl Hempel , " Two Models
Carl Gustav Hempel 's (19051997) classic account of explanation is widely known as the "cover ing-law model. " It includ es two species : the Deductive-Nomological Expla nation and the Probabilistic-Statist ical Explanation . Since its introduction in the semi nal pape r co-authored by Hempel and Paul Oppenheim (1948), the model has been intense ly debated and criticized in the philosophy of sc...
متن کاملHempel and the Flagpole
A standard counterexample to Hempel’s Deductive-Nomological (D-N) model of explanation is the example of the flagpole and its shadow. In this example, it is shown that the DN model allows one to explain the height of a flagpole by reference to the length of its shadow (in conjunction with other background premises). Because this seems intuitively unacceptable as an explanation, this example is ...
متن کاملGoodman, 'grue' and Hempel*
It is now commonly accepted that N. Goodman's predicate "grue" presents the theory of confirmation of C. G. Hempel (and other such theories) with grave difficulties. The precise nature and status of these "difficulties" has, however, never been made clear. In this paper it is argued that it is very unlikely that "grue" raises any formal difficulties for Hempel and appearances to the contrary ar...
متن کاملGenerating Explanation Trees even for Negations in Deductive DataBase Systems
Although there were enormous research efforts on explanation and debugging tools for Prolog in the last years, good tools for bottom-up evaluating logic programming systems are still missing, since the generation of the underlying proof trees matches several problems in presence of negation and recursion. This paper wants to fill the gap and presents a source-to-source transformation to compute...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Crítica (México D. F. En línea)
سال: 1967
ISSN: 1870-4905,0011-1503
DOI: 10.22201/iifs.18704905e.1967.33